Towards Rule Learning Approaches to Instance-based Ontology Matching
نویسندگان
چکیده
Ontology matching approaches have mostly worked on the schema level so far. With the advent of Linked Open Data and the availability of a massive amount of instance information, instance-based approaches become possible. This position paper discusses approaches and challenges for using those instances as input for machine learning algorithms, with a focus on rule learning algorithms, as a means for ontology matching.
منابع مشابه
A procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملSuperconcept Formation System–An Ontology Matching Algorithm for Sevice Discovery
Being a formal, declarative knowledge representation model, ontologies are the basis for Web applications, such as the service discovery. Because of their inherent heterogeneity, ontologies need to be matched before they can be made better use of. Most approaches in ontology matching belong to rule-based or learning-based ones, both with disadvantages. In this paper, we propose Superconcept For...
متن کاملA Survey of Schema Matching Research
Schema matching is the process of developing semantic matches between two or more schemas. The purpose of schema matching is generally either to merge two or more databases, or to enable queries on multiple, heterogeneous databases to be formulated on a single schema (Doan and Halevy 2005). This paper develops a taxonomy of schema matching approaches, classifying them as being based on a combin...
متن کاملAn Instance-based Learning Approach for Ontology Matching
This paper proposes an instance-based learning approach for the ontology matching problem. This approach is applicable to scenarios where instances of the ontologies to be matched are exchanged between sources. An initial population of instances is used as a training set of a non-supervised algorithm that constructs mappings between properties of classes from the ontologies. To demonstrate the ...
متن کاملA Probabilistic, Logic-based Framework for Automated Web Directory Alignment
We introduces oPLMap, a formal framework for automatically learning mapping rules between heterogeneous Web directories, a crucial step towards integrating ontologies and their instances in the Semantic Web. This approach is based on Horn predicate logics and probability theory, which allows for dealing with uncertain mappings (for cases where there is no exact correspondence between classes), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012